CONAN: a heuristic strategy for concurrent negotiating agents

نویسندگان

  • Bedour Alrayes
  • Özgür Kafali
  • Kostas Stathis
چکیده

We develop CONAN, a heuristic agent for concurrent bilateral negotiations in electronic markets that are open, dynamic and complex. Existing strategies often omit the factors determining when a market environment is open or how an agent evaluates progress in bilateral negotiations. Such omissions in turn damage the offer-making ability of an agent and consequently the number of successful negotiations that this agent can achieve. Negotiation experiments indicate that CONAN outperforms other agents that rely on the current state-of-the-art by a significant amount in terms of the utility gained during a negotiation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STRATUM: A Methodology for Designing Heuristic Agent Negotiation Strategies

Automated negotiation is a powerful (and sometimes essential) means for allocating resources among self-interested autonomous software agents. A key problem in building negotiating agents is the design of the negotiation strategy, which is used by an agent to decide its negotiation behaviour. In complex domains, there is no single, obvious optimal strategy. This has le4d to much work on designi...

متن کامل

Adaptive, Confidence-Based Strategic Negotiations in Complex Multiagent Environments

We have designed and implemented an adaptive, confidence-based negotiation strategy for conducting multiple, concurrent negotiations among agents in dynamic, uncertain, and real-time environments. Our strategy deals with how to assign multiple issues to a set of concurrent negotiations. When an agent is confident about a particular peer agent, it uses a packaged approach by negotiating on multi...

متن کامل

Negotiating Concurrently with Unknown Opponents in omplex, Real-Time Domains

We propose a novel strategy to enable autonomous agents to negotiate concurrently with multiple, unknown opponents in realtime, over complex multi-issue domains. We formalise our strategy as an optimisation problem, in which decisions are based on probabilistic information about the opponents’ strategies acquired during negotiation. In doing so, we develop the first principled approach that ena...

متن کامل

NB3: a Multilateral Negotiation Algorithm for Large, Non-linear Agreement Spaces with Limited Time

Existing work on automated negotiations has mainly focused on bilateral negotiations with linear utility functions. It is often assumed that all possible agreements and their utility values are given beforehand. Most real-world negotiations however are much more complex. We introduce a new family of negotiation algorithms that is applicable to domains with many agents, an intractably large spac...

متن کامل

A method for verifying concurrent Java components based on an analysis of concurrency failures

The Java programming language supports concurrency. Concurrent programs are harder to verify than their sequential counterparts due to their inherent non-determinism and a number of specific concurrency problems, such as interference and deadlock. In previous work, we have developed the ConAn testing tool for the testing of concurrent Java components. ConAn has been found to be effective at tes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014